|
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group ''G'' is the algorithmic problem of deciding whether two words in the generators represent the same element. More precisely, if ''A'' is a finite set of generators for ''G'' then the word problem is the membership problem for the formal language of all words in ''A'' and a formal set of inverses that map to the identity under the natural map from the free monoid with involution on ''A'' to the group ''G''. If ''B'' is another finite generating set for ''G'', then the word problem over the generating set ''B'' is equivalent to the word problem over the generating set ''A''. Thus one can speak unambiguously of the decidability of the word problem for the finitely generated group ''G''. The related but different uniform word problem for a class ''K'' of recursively presented groups is the algorithmic problem of deciding, given as input a presentation ''P'' for a group ''G'' in the class ''K'' and two words in the generators of ''G'', whether the words represent the same element of ''G''. Some authors require the class ''K'' to be definable by a recursively enumerable set of presentations. == History == Throughout the history of the subject, computations in groups have been carried out using various normal forms. These usually implicitly solve the word problem for the groups in question. In 1911 Max Dehn proposed that the word problem was an important area of study in its own right, , together with the conjugacy problem and the group isomorphism problem. In 1912 he gave an algorithm that solves both the word and conjugacy problem for the fundamental groups of closed orientable two-dimensional manifolds of genus greater than or equal to 2, . Subsequent authors have greatly extended Dehn's algorithm and applied it to a wide range of group theoretic decision problems. It was shown by Pyotr Novikov in 1955 that there exists a finitely presented group ''G'' such that the word problem for ''G'' is undecidable. It follows immediately that the uniform word problem is also undecidable. A different proof was obtained by William Boone in 1958. The word problem was one of the first examples of an unsolvable problem to be found not in mathematical logic or the theory of algorithms, but in one of the central branches of classical mathematics, algebra. As a result of its unsolvability, several other problems in combinatorial group theory have been shown to be unsolvable as well. It is important to realize that the word problem is in fact solvable for many groups ''G''. For example, polycyclic groups have solvable word problems since the normal form of an arbitrary word in a polycyclic presentation is readily computable; other algorithms for groups may, in suitable circumstances, also solve the word problem, see the Todd–Coxeter algorithm〔J.A. Todd and H.S.M. Coxeter. "A practical method for enumerating coset of a finite abstract group", ''Proc, Edinburgh Math Soc.'' (2), 5, 25---34. 1936〕 and the Knuth–Bendix completion algorithm.〔D. Knuth and P. Bendix. "Simple word problems in universal algebras." ''Computational Problems in Abstract Algebra'' (Ed. J. Leech) pages 263--297, 1970.〕 On the other hand the fact that a particular algorithm does not solve the word problem for a particular group does not show that the group has unsolvable word problem. For instance Dehn's algorithm does not solve the word problem for the fundamental group of the torus. However this group is the direct product of two infinite cyclic groups and so has solvable word problem. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Word problem for groups」の詳細全文を読む スポンサード リンク
|